An Optimal Two Stage Identification Algorithm for Discrete Hammerstein Time Delay Systems

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Finite-time Control of Positive Linear Discrete-time Systems

This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...

متن کامل

New Robust Stability Criteria for Uncertain Neutral Time-Delay Systems With Discrete and Distributed Delays

In this study, delay-dependent robust stability problem is investigated for uncertain neutral systems with discrete and distributed delays. By constructing an augmented Lyapunov-Krasovskii functional involving triple integral terms and taking into account the relationships between the different delays, new less conservative stability and robust stability criteria are established first using the...

متن کامل

Revisiting Hammerstein system identification through the Two-Stage Algorithm for bilinear parameter estimation

The Two-Stage Algorithm (TSA) has been extensively used and adapted for the identi cation of Hammerstein systems. It is essentially based on a particular formulation of Hammerstein systems in the form of bilinearly parameterized linear regressions. This paper has been motivated by a somewhat contradictory fact: though the optimality of the TSA has been established by Bai in 1998 only in the cas...

متن کامل

Continuous Time Hammerstein Systems Identification by Distributions

The paper presents a procedure for identification continuous-time Hammerstein systems. To improve the representation of the nonlinear functions, the set of basis functions is iteratively refined. It is possible to identify the dominant nonlinearities, applying a singular value decomposition to the input matrix. In our approach, the linear dynamic subsystem is described by a transfer function of...

متن کامل

Identification Aspects of Ritt’s Algorithm for Discrete-Time Systems

In system identification, the challenge of parameter estimation often lies in solving a non-convex optimization problem. In many cases, this implies that it is difficult to guarantee that the global optimum will be found. The tools of differential algebra, for example, Gröbner bases and Ritt’s algorithm, have turned out to be quite useful when dealing with certain nonlinear model structures. So...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IFAC-PapersOnLine

سال: 2016

ISSN: 2405-8963

DOI: 10.1016/j.ifacol.2016.07.466